Extracting Skeletons from Distance Maps
نویسنده
چکیده
A skeleton is a useful shape descriptor that encodes both boundary and region information for a given object. A widely used approach for skeletonization is to use a distance transform. Although many skeletonization algorithms have been developed, most methods involve the computation of high order derivatives and the evaluation of complex expressions. In this paper, we propose an algorithm that rapidly constructs a coarse graph representation of skeletons without involving the computation of complex high order derivatives. Thus, our method can be used to quickly produce the skeleton prototype of a given image. We also show that smooth skeletons in continuous space can be obtained from the coarse graph using the snake model. Since our method processes a given image as a whole, the presence of multiple objects in an image is automatically detected and the skeletons of those objects are computed simultaneously.
منابع مشابه
An Approach to Automatic Road Vectorization of Raster Maps
Rater maps are widely available for many areas around the globe. The road network that commonly exists in raster maps is an important source of road vector data for the areas for which road vectors are not readily available. To extract the road vector data from raster maps, the first step is to extract the pixels that represent roads from the raster maps (i.e., the road raster layers in the ras...
متن کاملApplications of the Region Growing Euclidean Distance Transform: Anisotropy and Skeletons
A new region growing algorithm has recently been proposed for computing Euclidean Distance Maps in a time comparable to widely used chamfer DT. In this paper we show how this algorithm can be extended to more complex tasks such as the computation of distance maps on an-isotropic grids and the generation of a new type of Euclidean skeletons.
متن کاملA Method for Quantitative Comparison of 2D Skeletons
Skeletons are widely used shape descriptors which summarize the general form of binary objects. There exist numerous skeletonization techniques that produce various skeleton-like features for the same object. Despite of the fact, that some researchers have made efforts to compare skeletons and evaluate skeletonization algorithms, we propose a new similarity measure that is based on the concept ...
متن کاملKnowledge-Based Interpretation of Road Maps Based on Symmetrical Skeletons
f' scanner raw.dataS ' 5 The objective of our research reported here is to show the various processing steps on all levels of a computer vision system required to interpret and describe road maps. First, the foundation for the recognition process is laid by computing two sets of distance skeletons. They are termed endoand exo-skeleton and are symmetrical with respect to the boundary between for...
متن کاملExtracting Noise-Resistant Skeleton on Digital Shapes for Graph Matching
In order to match shapes using their skeletons, these ones should be thin, robust to noise, homotopic to the shape, consequently, connected. However, these properties are difficult to obtain simultaneously when the shape is defined on a discrete grid. In this paper, we propose a new skeletonization algorithm, which has all these properties. Based on the Euclidean distance map, the algorithm ext...
متن کامل